Approximation schemes for scheduling and covering on unrelated machines
نویسندگان
چکیده
منابع مشابه
Randomized Approximation Schemes for Scheduling Unrelated Parallel Machines
The problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed, is considered. The standard problem of minimizing the makespan of the schedule (SUM) and the bicriteria problem of scheduling with bounded makespan and cost (SUMC) are addressed, and randomized fully linear time approximation schemes are shown for both of them. While matching the...
متن کاملApproximation Schemes for Scheduling on Parallel Machines
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depend on the machine completion times. As a main result, we identify some conditions on the objective function, under which the resulting scheduling problems possess a polynomial time approximation scheme. Our result cont...
متن کاملApproximation Algorithms for Stochastic Scheduling on Unrelated Machines
Motivated by problems in distributed computing, this thesis presents the first nontrivial polynomial time approximation algorithms for an important class of machine scheduling problems. We study the family of preemptive minimum makespan scheduling problems where jobs have stochastic processing requirements and provide the first approximation algorithms for these problems when machines have unre...
متن کاملApproximation Schemes for Scheduling on Parallel Machines with GoS Levels∗
We consider the offline scheduling problem of minimizing the makespan on m parallel and identical machines with certain feature. Every job and machine are labeled with the grade of service (GoS) levels, and each job can only be processed by the machine whose GoS level is no more than that of the job. In this paper, we present a polynomial time approximation scheme (PTAS) with running time O(n l...
متن کاملExperimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines
This paper presents an empirical comparison of polynomial-time approximation algorithms and local search heuristics for the problem of minimizing total weighted completion time on unrelated parallel machines. Algorithms with a worst-case performance guarantee are based on rounding a fractional solution to an LP-rela....<ation or to a convex quadratic programming relaxation. We also investigate ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.05.025